State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
نویسندگان
چکیده
منابع مشابه
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and the naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-source algorithm over each source. We introduce a stru...
متن کاملComparison of the deterministic and fuzzy approaches in HR planning
Supplying required human resource is one of the strategic goals of an organization. Therefore, organizations plan and predict the required human resources in order to prevent this problem. Present study using practical approach seeks to assist organizations to achieve their various goals in human resources planning. The designed model in this study clarifies vague, inaccurate, and fuzzy exp...
متن کاملImproved Non-Deterministic Planning by Exploiting State Relevance
We address the problem of computing a policy for fully observable non-deterministic (FOND) planning problems. By focusing on the relevant aspects of the state of the world, we introduce a series of improvements to the previous state of the art and extend the applicability of our planner, PRP, to work in an online setting. The use of state relevance allows our policy to be exponentially more suc...
متن کاملComparison of the deterministic and fuzzy approaches in HR planning
Supplying required human resource is one of the strategic goals of an organization. Therefore, organizations plan and predict the required human resources in order to prevent this problem. Present study using practical approach seeks to assist organizations to achieve their various goals in human resources planning. The designed model in this study clarifies vague, inaccurate, and fuzzy exp...
متن کاملDeterministic State Space Planning with BDDs
This short paper (cf. [5]) proposes a planner that uses BDDs to compactly represent sets of propositionally represented states. Using this representation, accurate reachability analysis and backward chaining can apparently be carried out without necessarily encountering exponential representation explosion. The main objectives are the interest in optimal solutions, the generality and the concis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2011
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.12.002